An Improvement of Key Generation Algorithm for Gentry's Homomorphic Encryption Scheme
نویسندگان
چکیده
One way of improving efficiency of Gentry’s fully homomorphic encryption from ideal lattices is controlling the number of operations, but our recollection is that any scheme which controls the bound has not proposed. In this paper, we propose a key generation algorithm for Gentry’s scheme that controls the bound of the circuit depth by using the relation between the circuit depth and the eigenvalues of a basis of a lattice. We present experimental results that show that the proposed algorithm is practical. We discuss security of the basis of the lattices generated by the algorithm for practical use.
منابع مشابه
Improved Key Generation Algorithm for Gentry's Fully Homomorphic Encryption Scheme
Abstract. At EUROCRYPT 2011, Gentry and Halevi implemented a variant of Gentry’s fully homomorphic encryption scheme. The core part in their key generation is to generate an odd-determinant ideal lattice having a particular type of Hermite Normal Form. However, they did not give a rigorous proof for the correctness. We present a better key generation algorithm, improving their algorithm from tw...
متن کاملImplementing Gentry's Fully-Homomorphic Encryption Scheme
We describe a working implementation of a variant of Gentry’s fully homomorphic encryption scheme (STOC 2009), similar to the variant used in an earlier implementation effort by Smart and Vercauteren (PKC 2010). Smart and Vercauteren implemented the underlying “somewhat homomorphic” scheme, but were not able to implement the bootstrapping functionality that is needed to get the complete scheme ...
متن کاملFaster Fully Homomorphic Encryption
We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardness assumptions (the one related to the Sparse Subset Sum Problem) and we introduce a probabilistic decryption algorithm that can be implemented with an algebraic circuit of low multiplicative degree. Combined together, these improv...
متن کاملMultiplicative Homomorphic E-Auction with Formally Provable Security
A new method, homomorphic e-auction based on multiplicative homomorphic encryption algorithm like ElGamal encryption is proposed in this paper. Its advantage is obvious and useful in practice: efficient distributed private key generation and thus efficient trust sharing. A long existing problem in homomorphic e-auction, inefficiency of bid validity check, is solved in the new multiplicative hom...
متن کاملAn Efficient Symmetric Based Algorithm for Data Security in Cloud Computing Through Homomorphic Encryption Scheme
The outstanding research topic on cryptography is called Fully Homomorphic Encryption (FHE), which allows computations to be carried out on encrypted data to the untrusted server of the security and privacy concerned related to emerging technologies like cloud computing. Various FHE schemes were developed after the first invention of Craig Gentry in 2009 which security is relying on bootstrappi...
متن کامل